Building Interpreters with Rewriting Strategies
نویسندگان
چکیده
منابع مشابه
Building Interpreters with Rewriting Strategies
Programming language semantics based on pure rewrite rules suffers from the gap between the rewriting strategy implemented in rewriting engines and the intended evaluation strategy. This paper shows how programmable rewriting strategies can be used to implement interpreters for programming languages based on rewrite rules. The advantage of this approach is that reduction rules are first class e...
متن کاملVariable elimination for building interpreters
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (the language which is used to build the interpreter). In order to transform user-defined functions into host language functions we use combinatory logic : λ-abstractions are transformed into a composition of combinators...
متن کاملTyped generic traversal with term rewriting strategies
A typed model of strategic term rewriting is developed. The key innovation is that generic traversal is covered. To this end, we define a typed rewriting calculus S γ . The calculus employs a many-sorted type system extended by designated generic strategy types γ. We consider two generic strategy types, namely the types of type-preserving and type-unifying strategies. S γ offers traversal combi...
متن کاملTerm rewriting with operator evaluation strategies
We consider a number of problems which arise when performing term rewriting in algebraic speciications with each operator having an evaluation strategy for its arguments. Each problem is illustrated with an OBJ3 example. We propose a solution developed for the evaluation of functional modules in the Maude interpreter which is based on maintaining an invariant on the term graph by copying subgra...
متن کاملContext-Sensitive Rewriting Strategies
Context-sensitive rewriting is a simple rewriting restriction which is formalized by imposing fixed restrictions on replacements. Such a restriction is given on a purely syntactic basis: it is given on the arguments of symbols of the signature and inductively extended to arbitrary positions of terms built from those symbols. The termination behavior is not only preserved but usually improved an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80427-4